Proportional Fair Scheduling in Hierarchical Modulation Aided Wireless Networks
نویسندگان
چکیده
منابع مشابه
Proportional Fair Scheduling with Capacity Estimation for Wireless Multihop Networks
In this paper, we investigate the scheduling problem to achieve the proportional fairness among the flows in wireless multihop networks with time-varying channel capacity. Using the signal to interference noise ratio and the outage probability, we present an estimate of time-varying capacity. Then, we achieve the proportional fairness in terms of maximizing the network utility functionwith cons...
متن کاملDelay controlled proportional fair scheduling in Rayleigh fading wireless channel
In this study, the authors consider a delay control problem with proportional fair scheduling in time-varying wireless channels. For proportional fairness of transmission rates among users, a congestion control scheme is proposed for guaranteeing both throughput and delay of the wireless network. Specifically, a scheduling weight is introduced to control queue lengths without degrading the thro...
متن کاملFair TDMA scheduling in wireless multihop networks
In wireless multihop networks, communication between two end-nodes is carried out by hopping over multiple wireless links. However, the fact that each node has to transmit not only its own traffic, but also traffic on behalf of other nodes, leads to unfairness among the communication rates of the nodes. Traditional Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) based media access c...
متن کاملFair packet scheduling in Wireless Mesh Networks
In this paper we study the interactions of TCP and IEEE 802.11 MAC in Wireless Mesh Networks (WMNs). We use a Markov chain to capture the behavior of TCP sessions, particularly the impact on network throughput due to the effect of queue utilization and packet relaying. A closed form solution is derived to numerically determine the throughput. Based on the developed model, we propose a distribut...
متن کاملMaxmin fair scheduling in wireless networks
We consider scheduling policies for maxmin fair allocation of bandwidth in wireless adhoc networks. We formalize the maxmin fair objective under wireless scheduling constraints. We propose a fair scheduling which assigns dynamic weights to the flows such that the weights depend on the congestion in the neighborhood and schedule the flows which constitute a maximum weighted matching. It is possi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Wireless Communications
سال: 2013
ISSN: 1536-1276
DOI: 10.1109/twc.2013.022013.120266